Abduction in Temporal Reasoning

Commonsense knowledge often omits the temporal incidence of facts, and even the ordering between occurrences is only available for some of their instances. Reasoning about the temporal extent of facts and their sequencing becomes complex due to this inherent partiality. The generation of hypotheses is adopted here as a natural way to overcome the difficulties in computing answers to temporal queries. The proposed abductive system performs temporal reasoning in a logic programming framework. Queries are taken as goals and the inference system combines deduct ion wi th abduct ion and constra int solv ing. The convenience of constraints for dealing with temporal information is widely recognized, their interest being twofold: the representation of essential properties of time and the provision for partial information, allowing flexible bounds on times instead of constant bindings. Inference manipulates a language associating propositions with time periods which are maximal intervals for the proposi t ion. The abduct ive inference procedure is descr ibed here, ident i fy ing the constra int operat ions required. I t is a lso shown that the outcome of a derivation is alwavs consistent with the information in the